Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs
نویسندگان
چکیده
We present a fast algorithm for uniform sampling of contiguous minimum cuts separating a source vertex from a set of sink vertices in a weighted undirected planar graph with n vertices embedded in the plane. The algorithm takes O(n) time per sample, after an initial O(n) preprocessing time during which the algorithm computes the number of all such contiguous minimum cuts. Contiguous cuts (that is, cuts where a naturally defined boundary around the cut set forms a simply connected planar region) have applications in computer vision and medical imaging [6, 14].
منابع مشابه
A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs
Given an edge-weighted undirected graph and a list of k source-sink pairs of vertices, the well-known minimum multicut problem consists in selecting a minimum-weight set of edges whose removal leaves no path between every source and its corresponding sink. We give the first polynomial-time algorithm to solve this problem in planar graphs, when k is fixed. Previously, this problem was known to r...
متن کاملMaximum st-Flow in Directed Planar Graphs via Shortest Paths
Minimum cuts have been closely related to shortest paths in planar graphs via planar duality – so long as the graphs are undirected. Even maximum flows are closely related to shortest paths for the same reason – so long as the source and the sink are on a common face. In this paper, we give a correspondence between maximum flows and shortest paths via duality in directed planar graphs with no c...
متن کاملA simple algorithm for multicuts in planar graphs with outer terminals
Given an edge-weighted graph G and a list of source-sink pairs of terminal vertices of G, the minimum multicut problem consists in selecting a minimum weight set of edges of G whose removal leaves no path from the ith source to the ith sink, for each i. Few tractable special cases are known for this problem. In this paper, we give a simple polynomial-time algorithm solving it in undirected plan...
متن کاملCounting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time
We give an O(nd + n log n) algorithm computing the number of minimum (s, t)-cuts in weighted planar graphs, where n is the number of vertices and d is the length of the shortest s-t path in the corresponding unweighted graph. Previously, Ball and Provan gave a polynomial-time algorithm for unweighted planar graphs with both s and t lying on the outer face. Our results hold for all locations of ...
متن کاملAn FPT algorithm for planar multicuts with sources and sinks on the outer face
Given a list of k source-sink pairs in an edge-weighted graph G, the minimum multicut problem consists in selecting a set of edges of minimum total weight in G, such that removing these edges leaves no path from each source to its corresponding sink. To the best of our knowledge, no non-trivial FPT result for special cases of this problem, which is APX-hard in general graphs for any fixed k ≥ 3...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012